Eh... kan du gjenta spørsmålet?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple, eh?

The aspect-oriented software development community has always shown great interest in language design, and simplicity is a very common criterion for the quality of such language design. However, we claim that simplicity is not so simple as it looks, and this paper proposes three different variants of simplicity in language design. Setting out from the recommended topic structure of papers for t...

متن کامل

Kan Extensions of Institutions

Institutions were introduced by Goguen and Burstall 8, 9, 10, 11] to formally capture the notion of logical system. Interpreting institutions as functors, and morphisms and representations of institutions as natural transformations, we give elegant proofs for the completeness of the categories of institutions with morphisms and representations, respectively, show that the duality between morphi...

متن کامل

SLAM Using EKF , EH ∞ and Mixed EH 2 / H ∞ Filter

The process of simultaneously building the map and locating a vehicle is known as Simultaneous Localization and Mapping (SLAM) and can be used for autonomous navigation. The estimation of vehicle states and landmarks plays an important role in SLAM. Most of the SLAM algorithms are based on extended Kalman filters (EKFs). However, Kalman filters are not the best choice for SLAM as they suffer fr...

متن کامل

Computing left Kan extensions

We describe a new extension of the Todd–Coxeter algorithm adapted to computing left Kan extensions. The algorithm is a much simplified version of that introduced by Carmody and Walters (Category Theory, Proceedings of the International Conference Held in Como, Italy, 22–28 July 1990. Springer) in 1991. The simplification allows us to give a straightforward proof of its correctness and terminati...

متن کامل

Left Kan Extensions Over !-Cat

An existing procedure to compute left Kan extensions over the ground category Set also computes left Kan extensions over the ground categories Cat, 2-Cat, n-Cat for any n and indeed !-Cat. Therefore extension data struc-tured in this manner already can make use of the left Kan extension notion of a best possible approximation. Examples include systems of labeled transition systems and certain h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: rus & avhengighet

سال: 2003

ISSN: 0809-2834

DOI: 10.18261/issn0809-2834-2003-03-19